A Comparitive Study of Different Customized Multiprocessor Scheduling Algorithms on Multicore Architecture

In real-time systems, a task needs to be performed correctly and timely. The correctness of each computation depends on both the logical results of the computation and the time at which results are produced. So “time” is most important in real-time application systems. Multicore and multithreaded CPUs becomes the new approach in real time system to achieve system performance, power efficiency, and software concerns in relation to application and workload characteristics. Multiprocessor Real time system requires an efficient algorithm to determine when and on which processor a given task should execute. The work presents a comparative study of different customized Multiprocessor scheduling algorithms which maximizes system performance and decides the real time tasks that can be processed without violating timing constraints. A major advantage of the simulation is that it provides a fast and easy way to evaluate the system performance in Real-time system and consider tasks priorities which cause higher system utilization and lowers deadline miss time. To overcome the run-time scheduling and the prioritizedpartitioned problems, accomplish a multiprocessor system which is capable of accurately simulating a variety of processor, memory, multiprocessor system on chip configurations and evaluate their effect on real-time system to improve the system performance. Index Terms – Real Time Operating System, Uniprocessor, Multi-Processor, Scheduling Algorithm, Context Switch, Multicore. __________________________________________________*****_________________________________________________